Signature-check Based Unification Filter
ثبت نشده
چکیده
Among the different processes that entail unification-based grammar parsing, the unification of feature structures is by far the most expensive one in terms of execution time. Unification of the feature structures of a given sentence typically takes between 85 and 98 per cent of the total elapsed time during parsing, thus the need to develop faster unification methods. The approach presented in this paper is based on the fact that, in general, between 60 and 85 per cent of unifications attempted in a typical parse result in failure. Our claim is that the efficient treatment of such unification failures reduces unification time significantly. In this paper we present what we call a unification filter or U-filter, that preprocesses the feature structures to be unified. If the U-filter succeeds, unification is then skipped because the attempt to unify the involved structures would result in failure. On the other hand, when the U-filter does not succeed it is not possible to determine at that moment whether or not the structures unify, so unification is performed. The U-filter stops around 87 per cent of unification failures, and speeds up unification time by an average of around 29 per cent over quasi-destructive graph unification, the fastest unification method known so far.
منابع مشابه
The Quick Check Pre-unification Filter for Typed Grammars: Further Advances
We present several significant improvements in the implementation of the quick check pre-unification filter [7] [10], and the potential way in which the design of the quick check [15] [17] can be further extended. We analyse the effect of these extensions on LinGO, the large-scale HPSG grammar for English[14]. Althought these developments were done for the compiler system LIGHT [8], most of the...
متن کاملThe Quick Check Pre-unification Filter for Typed Grammars: Extensions
The so called quick check (henceforth QC) preunification filter for feature structure (FS) unification was introduced by (Kiefer et al., 1999). QC is considered the most important speed-up technique in the framework of non-compiled FS unification. We present two potential ways in which the design of the quick check can be further extended: consistency sort check on coreferenced paths, and preun...
متن کاملImprovement and parallelization of Snort network intrusion detection mechanism using graphics processing unit
Nowadays, Network Intrusion Detection Systems (NIDS) are widely used to provide full security on computer networks. IDS are categorized into two primary types, including signature-based systems and anomaly-based systems. The former is more commonly used than the latter due to its lower error rate. The core of a signature-based IDS is the pattern matching. This process is inherently a computatio...
متن کاملEfficient feature structure operations without compilation
One major obstacle to efficient processing of large wide coverage grammars in unificationbased grammatical frameworks such as hpsg is the time and space cost of the unification operation itself. In a grammar development system it is not appropriate to address this problem with techniques which involve lengthy compilation, since this slows down the edit-test-debug cycle. Nor is it possible to ra...
متن کامل